The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels

A binary sequence satisfies a one-dimensional (d; k) run length constraint if every run of zeros has length at least d and at most k. A two-dimensional binary pattern is (d1; k1; d2; k2)-constrained if it satisfies the one-dimensional (d1; k1) run length constraint horizontally and the one-dimensional (d2; k2) run length constraint vertically. For given d1; k1; d2, and k2, the asymmetric two-di...

متن کامل

On the capacity of two-dimensional run-length constrained channels

Two-dimensional binary patterns that satisfy onedimensional (d; k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd; k is defined as Cd; k = limm;n!1 log2N (d; k) m;n =mn, where N (d; k) m;n denotes the number of m n rectangular patterns that satisfy the two-dimensional (d; k) run-length constraint. Bounds on Cd; k are given and it is ...

متن کامل

The Number of the Two Dimensional Run Length Constrained Arrays

First, a new framework describing the transfer matrices for the two dimensional run length constrained arrays (codes) is introduced, and some important properties of the transfer matrices ( 1) m T m  are derived in this framework. Then, using these properties, it is shown that the numbers ( , ) ( , 1) N m n m n  of the two dimensional binary arrays satisfying the (1, )  run length constraint...

متن کامل

Zero Capacity Region of Multidimensional Run Length Constraints

For integers d and k satisfying 0 d k, a binary sequence is said to satisfy a one-dimensional (d; k) run length constraint if there are never more than k zeros in a row, and if between any two ones there are at least d zeros. For n 1, the n-dimensional (d; k)-constrained capacity is defined as C(n) d;k = lim m1;m2;:::;mn!1 log2N (n;d;k) m1;m2;:::;mn m1m2 mn where N (n;d;k) m1;m2;:::;mn denotes ...

متن کامل

New Capacity-Approaching Codes for Run-Length-Limited Channels

To my parents ACKNOWLEDGEMENTS I have cherished the opportunity to work with Dr. Steven W. McLaughlin. His constant encouragement and enthusiasm have made us all feel comfortable. I am very grateful for his guidance, and wish him and his family the very best in coming years. V. Kuznetsov for several helpful discussions and insights. Other not-so-insightful, but nevertheless entertaining discuss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2006

ISSN: 0018-9448

DOI: 10.1109/tit.2006.883544